Antimagic vertex labelings of hypergraphs
نویسندگان
چکیده
منابع مشابه
Vertex-antimagic total labelings of graphs
In this paper we introduce a new type of graph labeling, the (a, d)vertex-antimagic total labeling, which is a generalization of several other types of labelings. A connected graph G(V, E) is said to be (a, d)-vertex-antimagic total if there exist positive integers a, d and a bijection λ : V ∪ E → {1, 2, . . . , |V | + |E|} such that the induced mapping gλ : V → W is also a bijection, where W =...
متن کاملAntimagic Labelings of Weighted and Oriented Graphs∗
A graph G is k–weighted–list–antimagic if for any vertex weighting ω : V (G) → R and any list assignment L : E(G)→ 2R with |L(e)| ≥ |E(G)|+k there exists an edge labeling f such that f(e) ∈ L(e) for all e ∈ E(G), labels of edges are pairwise distinct, and the sum of the labels on edges incident to a vertex plus the weight of that vertex is distinct from the sum at every other vertex. In this pa...
متن کاملOn d-antimagic labelings of plane graphs
The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called d-antimagic if for every positive integer s, the s-sided face weights form an arithmetic progression with a difference d. Such a labeling is called super if the sm...
متن کاملOn super vertex-antimagic total labelings of disjoint union of paths
Let G = (V,E) be a (p, q)-graph of order p and size q and f be a bijection from the set V ∪ E to the set of the first p + q natural numbers. The weight of a vertex is the sum of its label and the labels of all adjacent edges. We say f is an (a, d)-vertex-antimagic total labeling if the vertex-weights form an arithmetic progression with the initial term a and the common difference d. Such a labe...
متن کاملAntimagic and magic labelings in Cayley digraphs
A Cayley digraph is a digraph constructed from a group Γ and a generating subset S of Γ. It is denoted by CayD(Γ, S). In this paper, we prove for any finite group Γ and a generating subset S of Γ, that CayD(Γ, S) admits a super vertex (a, d)-antimagic labeling depending on d and |S|. We provide algorithms for constructing the labelings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00175-3